Some Alternative Ways to Find M-ambiguous Binary Words Corresponding to a Parikh Matrix

Parikh matrix of a word gives numerical information of the word in terms of its subwords. In this Paper an algorithm for finding Parikh matrix of a binary word is introduced. With the help of this algorithm Parikh matrix of a binary word, however large it may be can be found out. M-ambiguous words are the problem of Parikh matrix. In this paper an algorithm is shown to find the Mambiguous words of a binary ordered word instantly. We have introduced a system to represent binary words in a two dimensional field. We see that there are some relations among the representations of M-ambiguous words in the two dimensional field. We have also introduced a set of equations which will help us to calculate the Mambiguous words.